skip to main content


Search for: All records

Creators/Authors contains: "Qian, J."

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. In some applications, it is reasonable to assume that geodesics (rays) have a consistent orientation so that a time-harmonic elastic wave equation may be viewed as an evolution equation in one of the spatial directions. With such applications in mind, motivated by our recent work [Hadamard- Babich ansatz for point-source elastic wave equations in variable media at high frequencies, Multiscale Model Simul. 19/1 (2021) 46–86], we propose a new truncated Hadamard-Babich ansatz based globally valid asymptotic method, dubbed the fast Huygens sweeping method, for computing Green’s functions of frequency-domain point-source elastic wave equations in inhomogeneous media in the high-frequency asymptotic regime and in the presence of caustics. The first novelty of the fast Huygens sweeping method is that the Huygens-Kirchhoff secondary-source principle is used to integrate many locally valid asymptotic solutions to yield a globally valid asymptotic solution so that caustics can be treated automatically. This yields uniformly accurate solutions both near the source and away from it. The second novelty is that a butterfly algorithm is adapted to accelerate matrix-vector products induced by the Huygens-Kirchhoff integral. The new method enjoys the following desired features: (1) it treats caustics automatically; (2) precomputed asymptotic ingredients can be used to construct Green’s functions of elastic wave equations for many different point sources and for arbitrary frequencies; (3) given a specified number of points per wavelength, it constructs Green’s functions in nearly optimal complexity O(N logN) in terms of the total number of mesh points N, where the prefactor of the complexity depends only on the specified accuracy and is independent of the frequency parameter. Three-dimensional numerical examples are presented to demonstrate the performance and accuracy of the new method. 
    more » « less
  2. null (Ed.)
  3. Belkin, M. ; Kpotufe, S. (Ed.)
    We study the problem of robust learning under clean-label data-poisoning attacks, where the at-tacker injects (an arbitrary set of) correctly-labeled examples to the training set to fool the algorithm into making mistakes on specific test instances at test time. The learning goal is to minimize the attackable rate (the probability mass of attackable test instances), which is more difficult than optimal PAC learning. As we show, any robust algorithm with diminishing attackable rate can achieve the optimal dependence on ε in its PAC sample complexity, i.e., O(1/ε). On the other hand, the attackable rate might be large even for some optimal PAC learners, e.g., SVM for linear classifiers. Furthermore, we show that the class of linear hypotheses is not robustly learnable when the data distribution has zero margin and is robustly learnable in the case of positive margin but requires sample complexity exponential in the dimension. For a general hypothesis class with bounded VC dimension, if the attacker is limited to add at most t >0 poison examples, the optimal robust learning sample complexity grows almost linearly with t. 
    more » « less
  4. null (Ed.)
  5. A<sc>bstract</sc>

    A search for pair production of squarks or gluinos decaying via sleptons or weak bosons is reported. The search targets a final state with exactly two leptons with same-sign electric charge or at least three leptons without any charge requirement. The analysed data set corresponds to an integrated luminosity of 139 fb1of proton-proton collisions collected at a centre-of-mass energy of 13 TeV with the ATLAS detector at the LHC. Multiple signal regions are defined, targeting several SUSY simplified models yielding the desired final states. A single control region is used to constrain the normalisation of theWZ+ jets background. No significant excess of events over the Standard Model expectation is observed. The results are interpreted in the context of several supersymmetric models featuring R-parity conservation or R-parity violation, yielding exclusion limits surpassing those from previous searches. In models considering gluino (squark) pair production, gluino (squark) masses up to 2.2 (1.7) TeV are excluded at 95% confidence level.

     
    more » « less
    Free, publicly-accessible full text available February 1, 2025
  6. Free, publicly-accessible full text available January 1, 2025
  7. A<sc>bstract</sc>

    A search for supersymmetry targeting the direct production of winos and higgsinos is conducted in final states with either two leptons (eorμ) with the same electric charge, or three leptons. The analysis uses 139 fb1ofppcollision data at$$ \sqrt{s} $$s= 13 TeV collected with the ATLAS detector during Run 2 of the Large Hadron Collider. No significant excess over the Standard Model expectation is observed. Simplified and complete models with and withoutR-parity conservation are considered. In topologies with intermediate states including eitherWhorWZpairs, wino masses up to 525 GeV and 250 GeV are excluded, respectively, for a bino of vanishing mass. Higgsino masses smaller than 440 GeV are excluded in a naturalR-parity-violating model with bilinear terms. Upper limits on the production cross section of generic events beyond the Standard Model as low as 40 ab are obtained in signal regions optimised for these models and also for anR-parity-violating scenario with baryon-number-violating higgsino decays into top quarks and jets. The analysis significantly improves sensitivity to supersymmetric models and other processes beyond the Standard Model that may contribute to the considered final states.

     
    more » « less
    Free, publicly-accessible full text available November 1, 2024